Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
g(a) |
→ g(b) |
| 2: |
|
b |
→ f(a,a) |
| 3: |
|
f(a,a) |
→ g(d) |
|
There are 4 dependency pairs:
|
| 4: |
|
G(a) |
→ G(b) |
| 5: |
|
G(a) |
→ B |
| 6: |
|
B |
→ F(a,a) |
| 7: |
|
F(a,a) |
→ G(d) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006